//		ID : Xerxes
//      "I have not failed, I have just found 10000 ways that won't work.
//


#include <iostream>
#include <algorithm>
#include <vector>
#include <sstream>
#include <fstream>
#include <string>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>

#include <ctime>
#include <cassert>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <climits>
#include <cstring>
#include <cstdlib>

using namespace std;

#define VI vector< int >
#define CI( x ) scanf("%d",&x)
#define CL( x ) scanf("%lld",&x)
#define CD( x ) scanf("%lf",&x )
#define fo(i,st,ed) for(int i = st ; i < ed ; ++i )
#define foE(i,st,ed) for(int i = st ; i <= ed ; ++i )
#define foit(i, x) for (typeof((x).begin()) i = (x).begin(); i != (x).end(); i++)
#define bip system("pause")
#define Int long long
#define pb push_back
#define SZ(X) (int)(X).size()
#define LN(X) (int)(X).length()
#define mk make_pair
#define f first
#define s second
#define SET( ARRAY , VALUE ) memset( ARRAY , VALUE , sizeof(ARRAY) )
#define tp pair< int, pair<int,int> >
#define mmk( x, y , z ) mk( x, mk( y, z ) )

inline void wait( double seconds ){
    double endtime = clock()+( seconds* CLOCKS_PER_SEC );
    while( clock() < endtime ){
        ;
    }
}
int k;
int nodes,edges,query;
int dist[ 103 ][ 103 ];

inline void ini(){
	foE(i,0,100){
		foE(j,i+1,100){
			dist[j][i] = dist[i][j] = (int)1023456789;
			
		}
		dist[i][i]=0;		
	}
	
}
inline void Read(){
		ini();
		
		int x,y,c;
		fo(i,0,edges){
			CI(x);
			CI(y);
			CI(c);
			dist[x][y] = dist[y][x] = c;
		}
}
inline void floyed_warshal(){
		foE(i,1,nodes){
			foE(j,1,nodes){
				
				foE(k,1,nodes){
					dist[j][k] = min(dist[j][k] , max( dist[j][i], dist[i][k]) );			
				}
			}
		}
}
inline void Proc(){
	floyed_warshal();
	if( k!=1 )printf("\n");
	printf("Case #%d\n",k);++k;
	int x,y;
	fo(q,0,query){
		CI(x);
		CI(y);
		int var = dist[x][y];
		if( var >=(int)1023456789 ){
			printf("no path\n");
		}
		else{
			printf("%d\n",var);
		}
	}
}
int main(){
    #ifndef ONLINE_JUDGE
        freopen("in","rt",stdin);
    #endif
    
    for( k=1; scanf("%d %d %d",&nodes,&edges,&query)==3 ; ){
			if( nodes==0 && edges==0 && query==0 )break;
			Read();
			Proc();
    }

return 0;
}



